Symmetric Functions in Noncommuting Variables
نویسندگان
چکیده
Consider the algebra Q〈〈x1, x2, . . .〉〉 of formal power series in countably many noncommuting variables over the rationals. The subalgebra Π(x1, x2, . . .) of symmetric functions in noncommuting variables consists of all elements invariant under permutation of the variables and of bounded degree. We develop a theory of such functions analogous to the ordinary theory of symmetric functions. In particular, we define analogs of the monomial, power sum, elementary, complete homogeneous, and Schur symmetric functions as well as investigating their properties.
منابع مشابه
The Primitives and Antipode in the Hopf Algebra of Symmetric Functions in Noncommuting Variables
We identify a collection of primitive elements generating the Hopf algebra NCSym of symmetric functions in noncommuting variables and give a combinatorial formula for the antipode.
متن کاملPartitions, Rooks, and Symmetric Functions in Noncommuting Variables
Let Πn denote the set of all set partitions of {1, 2, . . . , n}. We consider two subsets of Πn, one connected to rook theory and one associated with symmetric functions in noncommuting variables. Let En ⊆ Πn be the subset of all partitions corresponding to an extendable rook (placement) on the upper-triangular board, Tn−1. Given π ∈ Πm and σ ∈ Πn, define their slash product to be π|σ = π∪(σ+m)...
متن کاملGeneralizing Rules of Three
This behavior has been seen in some notable cases. Kirillov [3] shows that elementary symmetric polynomials in noncommuting variables commute (and, in some cases, all Schur functions) when elementary symmetric polynomials of degree at most three commute when restricted to at most three of the variables. Generalizing this, Blasiak and Fomin [1] give a wider theory for rules of three of generatin...
متن کاملA Nichtnegativstellensatz for Polynomials in Noncommuting Variables
Let S ∪ {f} be a set of symmetric polynomials in noncommuting variables. If f satisfies a polynomial identity P i h ∗ i fhi = 1 + P i g ∗ i sigi for some si ∈ S ∪ {1}, then f is obviously nowhere negative semidefinite on the class of tuples of non-zero operators defined by the system of inequalities s ≥ 0 (s ∈ S). We prove the converse under the additional assumption that the quadratic module g...
متن کاملPlurigraph Coloring and Scheduling Problems
We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated symmetric function in noncommuting variables for which we give a deletion-contraction formula. In the case of graphs this symmetric function in noncommuting variab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002